منابع مشابه
Relating step-indexed logical relations and bisimulations
Operational logical relations and bisimulations are two particularly successful syntactic techniques for reasoning about program equivalence. Although both techniques seem to have common intuitions, their basis is on different mathematical principles: induction for the former, and co-induction for the latter. The intuitive understanding of the two techniques seems more common, but their mathema...
متن کاملStep-Indexed Logical Relations for Probability
It is well-known that constructing models of higher-order probabilistic programming languages is challenging. We show how to construct step-indexed logical relations for a probabilistic extension of a higher-order programming language with impredicative polymorphism and recursive types. We show that the resulting logical relation is sound and complete with respect to the contextual preorder and...
متن کاملA note on the transitivity of step-indexed logical relations
We present and discuss a simple semantic approach to force step-indexed logical relations to be transitive.
متن کاملStep-Indexed Syntactic Logical Relations for Recursive and Quantified Types
We present a proof technique, based on syntactic logical relations, for showing contextual equivalence of expressions in a λ-calculus with recursive types and impredicative universal and existential types. We show that for recursive and polymorphic types, the method is both sound and complete with respect to contextual equivalence, while for existential types, it is sound but incomplete. Our de...
متن کاملDenotational World-indexed Logical Relations and Friends
As part of the long-standing drive for mathematical machinery to reason aboutcomputer programs, we use the technique of denotational logical relations to provecontextual equivalence of stateful programs. We propose the notion of approximatelocations to solve the non-trivial problem of existence and solve the fundamentaltype-worlds circularity by metric-space theory. This approac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2011
ISSN: 1860-5974
DOI: 10.2168/lmcs-7(2:16)2011